A THREE-DIMENSIONAL DRAWING STANDARD INTENDED FOR LANDFORM
نویسندگان
چکیده
منابع مشابه
Three-Dimensional Graph Drawing
A three-dimensional straight-line grid drawing of a graph, henceforth called a 3D drawing, represents the vertices by distinct grid-points in Z and represents each edge by the line segment between its end vertices, such that no two edges cross. In contrast to the case in the plane, it is folklore that every graph has a 3D drawing. For example, the “moment curve” algorithm places the i th vertex...
متن کامل3DCube: A Tool for Three Dimensional Graph Drawing
In this paper we describe a tool that is a general frame for the three-dimensional representation of graphs, especially devoted to the algorithms evaluation, reenement and development. 3DCube (3D Diagram Drawer) ooers innovative features in the user interaction and contains a set of three-dimensional algorithms both taken from the literature and proposed by the authors.
متن کاملThree-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previous result generated a drawing bounded by an O( √ n) × O( √ n) × O( √ n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of bend=bounding box trade-o issues for thre...
متن کاملStandard edge detection algorithms versus conventional auto-contouring used for a three-dimensional rigid CT-CT matching
Background: To reduce uncertainties of patient positioning, the Computerized Tomography (CT) images acquired at the treatment planning time can be compared with those images obtained during radiation dose delivery. This can be followed during dose delivery procedure as Image Guided radiotherapy (IGRT) to verify the prescribed radiation dose delivery to the target as well as to monitor ...
متن کاملComplexity Results for Three-Dimensional Orthogonal Graph Drawing
In this paper we consider the problem of finding three-dimensional orthogonal drawings of maximum degree six graphs from the computational complexity perspective. We introduce the 3SAT reduction framework which can be used to prove the NP-hardness of finding three-dimensional orthogonal drawings with specific constraints. By using the framework we show that, given a three-dimensional orthogonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society of Civil Engineers, Ser. F3 (Civil Engineering Informatics)
سال: 2014
ISSN: 2185-6591
DOI: 10.2208/jscejcei.70.ii_27